Branching Bisimilarity Checking for PRS
نویسندگان
چکیده
Recent studies reveal that branching bisimilarity is decidable for both nBPP (normed Basic Parallel Processes) and nBPA (normed Basic Process Algebras). These results lead to the question if there are any other models in the hierarchy of PRS (Process Rewrite Systems) whose branching bisimilarity is decidable. It is shown in this paper that the branching bisimilarity for both nOCN (normed One Counter Nets) and nPA (normed Process Algebras) is undecidable. These results essentially imply that the question has a negative answer.
منابع مشابه
GPU Accelerated Strong and Branching Bisimilarity Checking
Bisimilarity checking is an important operation to perform explicit-state model checking when the state space of a model under verification has already been generated. It can be applied in various ways: reduction of a state space w.r.t. a particular flavour of bisimilarity, or checking that two given state spaces are bisimilar. Bisimilarity checking is a computationally intensive task, and over...
متن کاملChecking Equality and Regularity for nBPA with Silent Moves
The decidability of weak bisimilarity on normed BPA is a long standing open problem. It is proved in this paper that branching bisimilarity, a standard refinement of weak bisimilarity, is decidable for normed BPA and that the associated regularity problem is also decidable.
متن کاملChecking Equality and Regularity for Normed BPA with Silent Moves
The decidability of weak bisimilarity on normed BPA is a long standing open problem. It is proved in this paper that branching bisimilarity, a standard refinement of weak bisimilarity, is decidable for normed BPA and that the associated regularity problem is also decidable.
متن کاملA Polynomial Time Algorithm for Deciding Branching Bisimilarity on Totally Normed BPA
Strong bisimilarity on normed BPA is polynomial-time decidable, while weak bisimilarity on totally normed BPA is NP-hard. It is natural to ask where the computational complexity of branching bisimilarity on totally normed BPA lies. This paper confirms that this problem is polynomial-time decidable. To our knowledge, in the presence of silent transitions, this is the first bisimilarity checking ...
متن کاملDividing Line between Decidable PDA's and Undecidable Ones
Sénizergues has proved that language equivalence is decidable for disjoint ǫ-deterministic PDA. Stirling has showed that strong bisimilarity is decidable for PDA. On the negative side Srba demonstrated that the weak bisimilarity is undecidable for normed PDA. Later Jančar and Srba established the undecidability of the weak bisimilarity for disjoint ǫ-pushing PDA and disjoint ǫ-popping PDA. Thes...
متن کامل